import math
from collections import *
for _ in range(int(input())):
n=int(input())
l=list(input())
dic={}
x=Counter(l)
a=0
tt=[]
for i in range(0,len(l)+1):
if(a>=i/2 and x['1']>=(n-i)/2):
tt.append(i)
if(i<n):
if(l[i]=='0'):
a+=1
x[l[i]]-=1
ans=-1
for i in tt:
if ans==-1:
ans=i
else:
if(abs(n/2-i)<abs(n/2-ans)):
ans=i
print(ans)
h
260. Single Number III | 240. Search a 2D Matrix II |
238. Product of Array Except Self | 229. Majority Element II |
222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |